- branch-and-bound search
- поиск методом ветвей и границ
English-Russian electronics dictionary .
branch-and-bound search
Смотреть что такое "branch-and-bound search" в других словарях:
Branch and bound — (BB) is a general algorithm for finding optimal solutions of various optimization problems, especially in discrete and combinatorial optimization. It consists of a systematic enumeration of all candidate solutions, where large subsets of… … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
Nearest neighbor search — (NNS), also known as proximity search, similarity search or closest point search, is an optimization problem for finding closest points in metric spaces. The problem is: given a set S of points in a metric space M and a query point… … Wikipedia
Divide and conquer algorithm — In computer science, divide and conquer (D C) is an important algorithm design paradigm based on multi branched recursion. A divide and conquer algorithm works by recursively breaking down a problem into two or more sub problems of the same (or… … Wikipedia
Labour and tax laws in Iran — govern the employment and fiscal contributions of people working and living in Iran. Roughly one fourth of Iran s labour forc is engaged in manufacturing and construction. Another one fifth is engaged in agriculture, and the remainder are divided … Wikipedia
DNA repair and recombination protein RAD54-like — RAD54 like (S. cerevisiae) Identifiers Symbols RAD54L; HR54; RAD54A; hHR54; hRAD54 External IDs … Wikipedia
Computational phylogenetics — is the application of computational algorithms, methods and programs to phylogenetic analyses. The goal is to assemble a phylogenetic tree representing a hypothesis about the evolutionary ancestry of a set of genes, species, or other taxa. For… … Wikipedia
Distributed constraint optimization — (DCOP or DisCOP) is the distributed analogue to constraint optimization. A DCOP is a problem in which a group of agents must distributedly choose values for a set of variables such that the cost of a set of constraints over the variables is… … Wikipedia
SLD resolution — ( Selective Linear Definite clause resolution) is the basic inference rule used in logic programming. It is a refinement of resolution, which is both sound and refutation complete for Horn clauses. The SLD inference ruleGiven a goal clause: eg L… … Wikipedia
Early life and military career of John McCain — The early life and military career of John Sidney McCain III spans forty five years (1936 ndash;1981). McCain s father and grandfather were admirals in the United States Navy. McCain was born in the Panama Canal Zone, and attended many schools… … Wikipedia
Mormonism and Judaism — The doctrines of the Latter Day Saint movement, commonly referred to as Mormonism, teach that its adherents, Latter day Saints, are either direct descendants of the House of Israel, or are adopted into it. As such, Judaism is foundational to the… … Wikipedia
